搜索资源列表
ant-colony-algorithm(ACO)
- 蚁群算法实现TSP问题，代码由MATLAB编写，可直接运行，直接修改初始城市数据即可-Ant colony algorithm TSP problem, the code is written in MATLAB can be directly run, the data can directly modify the initial cities
ACO
- TSP旅行商问题，解决城市旅行距离最短的问题，基于蚁群算法求解。-TSP traveling salesman problem, solve the problem of urban travel the shortest distance, based on ant colony algorithm.
TSP_ACO_MMAS
- tsp ACO MMAS matlab source code
ACO
- aco code in matlab for tsp
ACO-to-solve-TSP-problem
- 算法使用蚁群算法求解TSP问题，使得最终所需时间短，效率高。-Algorithm using ant colony algorithm for TSP problem, so that the final time is short, high efficiency.
aco
- 描述蚁群算法的功能及应用，及其在TSP中的实现-Function and Application of ant colony algorithm is described, and its implementation in the TSP
ACO-TSP
- 对于蚁群算法求解TSP问题进行改进，可直接在文件中写入经纬度进行算法计算，算法的起始点为固定点，通过遍历找到最小值，起始点不是同一点。-For the ant colony algorithm for TSP to improve, the latitude and longitude can be written directly in the document the algorithm to calculate the starting point for fixed point arit
ACO
- TSP问题的人工蚁群算法中，假设m只蚂蚁在图的相邻节点间移动，从而协作异步地得到问题的解。每只蚂蚁的一步转移概率由图中的每条边上的两类参数决定：1、信息素质，也称信息素痕迹。2、可见度，即先验值。-Artificial ant colony algorithm TSP problem, assume that m ants move between adjacent nodes in the graph, which asynchronously collaborate get problem
05-ACO-for-TSP
- this code is ACO for TCP. work with this GA very simple.
ACO-for-TSP
- aco ant system matlab aco tsp
aco
- 蚁群算法是现代优化算法，这个是直接可以编译通过的蚁群算法求解51城市的TSP问题的MATLAB源代码 -Ant colony algorithm is a modern optimization algorithm, which is directly compiled by the ant colony algorithm to solve the 51 cities of the TSP problem MATLAB source code
ACO-tsp
- 利用蚁群算法求解tsp问题的源代码，这个模板能够运行。 如果你想带入自己的数据只需要修改城市的坐标矩阵（也就是C）和蚂蚁数量、迭代次数就能很好的运行并得到结果了。 希望对你学习蚁群算法有所帮助。-Using the ant colony algorithm to solve the tsp problem source code, this template can run. If you want to bring your own data only need to modify
Solve TSP using Ant Colony Optimization
- Solve Travelling Salesman Problem Using Ant Colony Optimization
ACO
- Ant Colony Optimization for TSP
ACO
- matlab code Ant colony optimization for solve Travelling salesman problem
最基本的蚁群算法+2opt邻域搜索_求解TSP
- 蚁群算法，蚁群优化算法（ant colony optimization,ACO）就是一种特别成功的元启发式算法，在20年前诞生于意大利的一所最负盛名的大学——米兰理工大学。其灵感来源于真实蚂蚁的行为。(We list below 25 TSP instances taken from the World TSP. For these instances, the cost of travel between cities is specified by the Eulidean distance
针对TSP问题的各种蚁群优化程序ACOTSP-1.03
- 针对TSP问题的各种ACO蚁群优化算法的程序，C++语言实现， 对研究蚁群优化的小伙伴有所帮助(ACO ant colony optimization algorithm The program of various ACO ant colony optimization algorithms for the TSP problem and the implementation of the C++ language are helpful to the small partners stu
TPS ANT
- 使用蚁群算法解决TSP问题，python2.7(solve TSP with ACO algorithm)
79419092ACO---pso-MTSP-
- ACO-PSO结合的解决TSP问题的一种方法(The ACO-PSO combines a solution to the TSP problem and the algorithm is very reliable.)
ACO for TSP
- 蚁群算法解决旅行商问题，能够成功运行并且有结果(Ant colony algorithm can solve the traveling salesman problem and run successfully.)